n-ary algebras: a review with applications

On $n$-ary Hypergroups and Fuzzy $n$-ary Homomorphism

Varieties of Anticommutative n-ary Algebras

A fundamental problem in the theory of n-ary algebras is to determine the correct generalization of the Jacobi identity. This paper describes some computational results on this problem using representations of the symmetric group. It is well known that over a field of characteristic 0 any variety of n-ary algebras can be defined by multilinear identities. In the anticommutative case, it is show...

n-ary associative algebras, cohomology, free algebras and coalgebras

When n is odd, a cohomology of type Hochschild for n-ary partially associative algebras has been defined in Gnedbaye’s thesis. Unfortunately, the cohomology definition is not valid when n is even. This fact is found again in the computations of the n-ary partially associative free algebra. In this work, we define in a first time two approachs of an Hochschild cohomology for n-ary partially asso...

Combinatorics of k-ary n-cubes with Applications to Partitioning

Many communication networks can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes, and toruses. This paper explores combinatorial properties of such graphs—in particular, the characterization of the subgraph of a given number of nodes with maximum edge count. Applications of these properties to partitioning parallel computations will also be discussed.

n-ARY Hv-MODULES WITH EXTERNAL n-ARY P -HYPEROPERATION

Hyperstructure theory was born in 1934 when Marty [19] defined hypergroups as a generalization of groups. Let H be a non-empty set and let ℘∗(H) be the set of all non-empty subsets of H. A hyperoperation on H is a map ◦ : H ×H −→ ℘∗(H) and the couple (H, ◦) is called a hypergroupoid. If A and B are non-empty subsets of H, then we denote A◦B = ∪ a∈A, b∈B a◦b, x◦A = {x}◦A and A◦x = A◦{x}. Under c...